Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost
نویسندگان
چکیده
A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to have a so-called “quasi-symmetry” property under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process maximizes the channel’s block mutual information, resulting in a closed-form formula for its non-feedback capacity in terms of the noise-erasure entropy rate and the entropy rate of an auxiliary erasure process. The feedback channel capacity is also characterized, showing that feedback does not increase capacity and generalizing prior related results. The capacity-cost function of the channel with and without feedback is also investigated. A sequence of finite-letter upper bounds for the capacity-cost function without feedback is derived. Finite-letter lower bonds for the capacity-cost function with feedback are obtained using a specific encoding rule. Based on these bounds, it is demonstrated both numerically and analytically that feedback can increase the capacity-cost function for a class of channels with Markov noise-erasure processes. Index Terms Channels with burst errors and erasures, channels with memory, channel symmetry, non-feedback and feedback capacities, non-feedback and feedback capacity-cost functions, input cost constraints, stationary ergodic and Markov processes. The authors are with the Department of Mathematics and Statistics, Queen’s University, Kingston, Ontario K7L 3N6, Canada (Emails: [email protected], {fady, linder}@mast.queensu.ca). This work was supported in part by NSERC of Canada. Parts of this work will be presented at the 2017 IEEE International Symposium on Information Theory. May 5, 2017 DRAFT ar X iv :1 70 5. 01 59 6v 1 [ cs .I T ] 3 M ay 2 01 7
منابع مشابه
On the Capacity Region of Broadcast Packet Erasure Relay Networks With Feedback
We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of the outer bound for various classes of networks. An important engineering implication of this work is that for network coding schemes for parallel broadcast ...
متن کاملThe capacity-cost function of discrete additive noise channels with and without feedback
We consider moduloadditive noise channels, where the noise process is a stationary irreducible and aperiodic Markov chain of order . We begin by investigating the capacity-cost function ( ( )) of such additive-noise channels without feedback. We establish a tight upper bound to ( ( )) which holds for general (not necessarily Markovian) stationary -ary noise processes. This bound constitutes the...
متن کاملCapacity of Interactive Communication over Erasure Channels and Channels with Feedback
We consider interactive communication performed over two simple types of noisy channels: binary error channels with noiseless feedback and binary erasure channels. In both cases, the noise model is adversarial. Assuming at most εfraction of the bits can be corrupted, we show coding schemes that simulate any alternating interactive protocol with rate 1 − Θ(H(ε)). All our simulations are simple, ...
متن کاملThe Feedback Capacity of the $(1,\infty)$-RLL Input-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملInput-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1705.01596 شماره
صفحات -
تاریخ انتشار 2017